搜索资源列表
TSP_main_Program
- 此算法为模拟退火算法，典型例题为旅行商选路问题，也可用于计算机网络中的路由选择问题-Simulated annealing algorithm
SA_TSP
- 模拟退火算法求解旅行商问题的Matlab源程序-Simulated annealing algorithm for traveling salesman problem Matlab source
SA_solve_TSP
- 模拟退火算法解决旅行商问题，操作步骤详见readme.txt-Simulated annealing algorithm to solve the traveling salesman problem, the steps described in Readme.txt
simulated-annealing
- 智能优化算法—模拟退火算法解旅行商路径最短-Intelligent optimization algorithm- simulated annealing algorithm for solving the traveling salesman shortest path
Annealing-algorithm
- 使用模拟退火选择路径问题，例如一个旅行商问题，给定N个城市，有一个推销员必须遍访这N个城市，而且每个城市只能访问一次最后回到出发的那个城市，要求安排合理的访问顺序，以实现访问路线最短的目标。-Select the path using the simulated annealing problems, such as a traveling salesman problem, given N cities, a salesman must have visited this N cities,
traveling-salesman-problem
- 旅行商问题研究，对初学者对禁忌搜索，蚁群算法，和模拟退火有很大帮助。-Traveling Salesman Problem, for beginners tabu search, ant colony algorithm, and simulated annealing of great help.
SA
- 针对于多个城市的最短距离问题或旅行商问题，模拟退火算法，C#程序-For the shortest distance problem or traveling salesman problem in many cities, simulated annealing algorithm, C# program
monituihuo
- 利用模拟退火算法解决旅行商问题，显著提高算法的运算效率。-Using simulated annealing algorithm to solve the traveling salesman problem, significantly improving operational efficiency of the algorithm.
TSP(GAaSA)
- 基于模拟退火的遗传算法求解旅行商TSP问题-TSP by GA+SA
SAA-TSP
- 模拟退火算法解决旅行商问题，城市数量27，初始温度3000，温度衰减率0.95。 -Simulated annealing algorithm to solve the traveling salesman problem, 27 the number of cities, the initial temperature of 3000, the rate of temperature decay 0.95.
tsp
- 使用模拟退火算法实现著名的旅行商问题，该压缩包中有完整的matlab源码和实验的截图。-Simulated annealing algorithm famous traveling salesman problem, the complete package includes shots of matlab source and the compression experiments.
City
- 使用著名的模拟退火算法来求解城市旅行商问题-Use well-known ant colony algorithm to solve the traveling salesman problem
TSP
- 利用模拟退火算法求解旅行商问题，从文件读入城市信息，输出结果到文件-TSP problem
Matlab-SA-tool-and-example
- Matlab的模拟退火算法工具箱与实例，包括最经典的旅行商问题等-Matlab toolbox simulated annealing algorithm and examples, including the most classic traveling salesman problem, etc.
MatLab-Script
- 基于启发式(Heuristic)的人工智能算法解决旅行商问题(Traveling Salesman Problem)。关键词：模拟退火，遗传算法。工作环境：matlab-An artificial intelligence algorithm based on heuristic to solve Traveling Salesman Problem(TSP). Key words: Simulated Annealing, Genetic Algorithm. Working environm
my_SAlvxingshang
- 基于模拟退火算法求解旅行商问题，程序收敛性能好，结果满意-Based on simulated annealing algorithm to solve traveling salesman problem, the convergence program performance, satisfactory results
Simulated-Annealing-solving-TSP
- 此段程序是用模拟退火思想解决旅行商TSP问题，有详细步骤说明。-This program solves the Traveling Salesman Problem(TSP) using an intelligent algorithm of the simulated annealing,which detail steps are explained.
TSP
- 用MATLAB实现的模拟退火算法，去有效的解决旅行商问题（TSP问题）。-MATLAB simulation annealing algorithm, to effectively solve the traveling salesman problem (TSP).
MTSP
- 多旅行商MTSP问题遗传算法应用遗传算法求解多旅行商问题的算法设计,并将其与模拟退火算法比较与结合,有效提高了运算的速度和效率。-Multi traveling salesman MTSP problem genetic algorithm genetic algorithm to solve the problem of multiple traveling salesman problem algorithm design, and it is compared with the simul
monituihuo
- 模拟退火算法的源代码，可有效解决旅行商问题（TSP）。-Simulated annealing algorithm source code, which can effectively solve the traveling salesman problem (TSP).